Lower Bounds for Non-binary Constraint Optimization Problems
نویسندگان
چکیده
منابع مشابه
New Lower Bounds of Constraint Violations for Over-Constrained Problems
In recent years many works have been carried out to solve over constrained problems and more speci cally the Maximal Constraint Satisfaction Problem Max CSP where the goal is to minimize the num ber of constraint violations Some lower bounds on this number of vio lations have been proposed in the literature In this paper we characterize the constraints that are ignored by the existing results w...
متن کاملTwo-Level Optimization Problems with Infinite Number of Convex Lower Level Constraints
This paper proposes a new form of optimization problem which is a two-level programming problem with infinitely many lower level constraints. Firstly, we consider some lower level constraint qualifications (CQs) for this problem. Then, under these CQs, we derive formula for estimating the subdifferential of its valued function. Finally, we present some necessary optimality condit...
متن کاملSolving Intensional Weighted CSPs by Incremental Optimization with BDDs
We present a method for solving weighted Constraint Satisfaction Problems, based on translation into a Constraint Optimization Problem and iterative calls to an SMT solver, with successively tighter bounds of the objective function. The novelty of the method herewith described lies in representing the bound constraint as a shared Binary Decision Diagram, which in turn is translated into SAT. Th...
متن کاملBranch-and-cut for combinatorial optimization problems without auxiliary binary variables
Many optimization problems involve combinatorial constraints on continuous variables. An example of a combinatorial constraint is that at most one variable in a group of nonnegative variables may be positive. Traditionally, in the mathematical programming community, such problems have been modeled as mixed-integer programs by introducing auxiliary binary variables and additional constraints. Be...
متن کاملThe Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems
We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models are robust in the sense that they exhibit a non-trivial threshold of satisfiability, and we determine the asymptotic order of that threshold. We also provide resolution complexity lower bounds for these models. One of our resul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001